Almost sure rates of mixing for i.i.d. unimodal maps

Almost Sure Rates of Mixing for I.i.d. Unimodal Maps

Almost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples

Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...

Strong stochastic stability and rate of mixing for unimodal maps

We consider small random perturbations of a large class of nonuniformly hy-perbolic unimodal maps and prove stochastic stability in the strong sense (L 1-convergence of invariant densities) and uniform bounds for the exponential rate of decay of correlations. Our method is based on an analysis of the spectrum of a modiied Perron-Frobenius operator for a tower extension of the Markov chain.

Almost Sure Invariance Principle for Random Piecewise Expanding Maps

The objective of this note is to prove the almost sure invariance principle (ASIP) for a large class of random dynamical systems. The random dynamics is driven by an invertiblemeasure preserving transformation σ of (Ω,F ,P) called the base transformation. Trajectories in the phase space X are formed by concatenations f ω := fσn−1ω ◦ · · · ◦ fσω ◦ fω of maps from a family of maps fω : X → X, ω ∈...

Almost Sure Productivity

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...